首页> 外文OA文献 >Efficient resources assignment schemes for clustered multithreaded processors
【2h】

Efficient resources assignment schemes for clustered multithreaded processors

机译:集群多线程处理器的高效资源分配方案

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

New feature sizes provide larger number of transistors per chip that architects could use in order to further exploit instruction level parallelism. However, these technologies bring also new challenges that complicate conventional monolithic processor designs. On the one hand, exploiting instruction level parallelism is leading us to diminishing returns and therefore exploiting other sources of parallelism like thread level parallelism is needed in order to keep raising performance with a reasonable hardware complexity. On the other hand, clustering architectures have been widely studied in order to reduce the inherent complexity of current monolithic processors. This paper studies the synergies and trade-offs between two concepts, clustering and simultaneous multithreading (SMT), in order to understand the reasons why conventional SMT resource assignment schemes are not so effective in clustered processors. These trade-offs are used to propose a novel resource assignment scheme that gets and average speed up of 17.6% versus Icount improving fairness in 24%.
机译:新的功能尺寸为每个芯片提供了更多的晶体管,供架构师使用,以进一步利用指令级并行性。但是,这些技术也带来了新的挑战,使传统的单片处理器设计变得复杂。一方面,利用指令级并行性使我们减少了收益,因此,需要利用其他并行性源(如线程级并行性)来以合理的硬件复杂度不断提高性能。另一方面,为了降低当前单片处理器的固有复杂性,已经对集群体系结构进行了广泛的研究。本文研究了群集和同步多线程(SMT)这两个概念之间的协同作用和取舍,以了解常规SMT资源分配方案在群集处理器中如此无效的原因。这些折衷方案用于提出一种新颖的资源分配方案,该方案的平均速度为17.6%,而Icount的平均速度为24%。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号